Grounding System Cost Analysis Using Optimization Algorithms
نویسندگان
چکیده
منابع مشابه
COST OPTIMIZATION OF END-FILLED CASTELLATED BEAMS USING META-HEURISTIC ALGORITHMS
The main object of this research is to optimize an end-filled castellated beam. In order to support high shear forces close to the connections, sometimes it becomes necessary to fill certain holes in web opening beam. This is done by inserting steel plates and welding from both sides. Optimization of these beams is carried out using three meta-heuristic methods involves CSS, CBO, and CBO-PSO al...
متن کاملRecco: recombination analysis using cost optimization
MOTIVATION Recombination plays an important role in the evolution of many pathogens, such as HIV or malaria. Despite substantial prior work, there is still a pressing need for efficient and effective methods of detecting recombination and analyzing recombinant sequences. RESULTS We introduce Recco, a novel fast method that, given a multiple sequence alignment, scores the cost of obtaining one...
متن کاملCost optimization of composite beams using genetic algorithms
This paper presents a genetic algorithm model for the cost optimization of composite beams based on the Load and Resistance Factor Design (LRFD) specifications of the AISC. The model formulation includes the costs of concrete, steel beam, and shear studs. Two examples taken from the literature were analyzed in order to validate the model, to illustrate its use, and to demonstrate its capabiliti...
متن کاملHeat Exchanger Exergetic Lifecycle Cost Optimization using Evolutionary Algorithms
Considering lifecycle cost analysis during the design phase of thermal systems gives the design effort more worth. Furthermore thermodynamic exergetic optimization is a proven useful method for determining the most lifecycle cost optimal design of thermal systems for given thermodynamic constraints. The most thermodynamic efficient heat exchanger design basing on first law analysis may not be t...
متن کاملParallel Cost Approximation Algorithms for Differentiable Optimization
This paper presents a uniied analysis of decomposition algorithms for continuously diierentiable optimization problems deened on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approximation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which encompasses the classical Gauss{...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2018
ISSN: 1996-1073
DOI: 10.3390/en11123484